A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves
نویسندگان
چکیده
منابع مشابه
A Secure Money Transaction Scheme (Identification Scheme) using Elliptic Curves
Identification protocols have an important role for building secure communications amongst two or more entities over the internet. In this paper we introduce a new identification scheme (or money transaction protocol) based on the elliptic curve Diffie Hellman problem. We show that our protocol meets the security attributes under the assumption that the elliptic curve discrete logarithm problem...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملMessage Recovery Signature Scheme Using Complementary Elliptic Curves
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this concept is hard to break, therefore this criteria has given mathematicians a courage to explore this area of research. Earlier in [10], we have showed a new method for imbedding plaintexts using complementary elliptic c...
متن کاملA Secure Chaos-Based Communication Scheme in Multipath Fading Channels Using Particle Filtering
In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. Unfortunately, despite the advantages of chaotic systems, Such as, noise-like correlation, easy hardware implementation, multitude of chaotic modes, flexible control of their dynamics, chaotic self-synchronization phenomena and potential communication confidence due to the very dynami...
متن کاملA Provably Secure Elliptic Curve Scheme with Fast Encryption
We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n, where n is an RSA modulus, and merges ideas from Paillier and Rabin related schemes. Despite the typical bit length of n, our encryption algorithm is faster than El Gamal elliptic curve cryptosystems. The one-wayness of the ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/4814-7051